Inherent Fault Tolerance in Evolved Sorting Networks

نویسندگان

  • Rob Shepherd
  • James A. Foster
چکیده

This poster paper summarizes our research on fault tolerance arising as a by-product of the evolutionary computation process. Past research has shown evidence of robustness emerging directly from the evolutionary process, but none has examined the large number of diverse networks we used. Despite a thorough study, the linkage between evolution and increased robustness is unclear.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Title: Fault Tolerance in Evolved Sorting Networks: the Mechanism Responsible for Inherent Robustness

Research has indicated that evolutionary design confers a certain degree of fault tolerance on circuits created by these methods, but the mechanism responsible for this effect has been elusive. We postulate that this effect is apparent in evolved sorting networks and seek to isolate the underlying method behind it. We compared evolved and hand-designed sorting networks, using a measure of robus...

متن کامل

FDMG: Fault detection method by using genetic algorithm in clustered wireless sensor networks

Wireless sensor networks (WSNs) consist of a large number of sensor nodes which are capable of sensing different environmental phenomena and sending the collected data to the base station or Sink. Since sensor nodes are made of cheap components and are deployed in remote and uncontrolled environments, they are prone to failure; thus, maintaining a network with its proper functions even when und...

متن کامل

Lower Bounds on Correction Networks

Correction networks are comparator networks that sort inputs differing from sorted sequences of length N in a small number of positions. The main application of such networks is producing fault-tolerant sorting networks. We show the lower bound 1.44log2 N on the depth of correction networks settling an open problem from [7]. This bound is tight since the upper bound 1.44log2 N is known.

متن کامل

Diverse Sorting Algorithm Analysis for ACSFD in Wireless Sensor Networks

The progression in wireless communications and electronics has emerged the expansion of low-cost sensor networks. Sensor networks exploit large number of wireless sensor nodes to collect information from their sensing terrain. The gathered information will undergo in-network process and send to the remote sink. Sensor networks have wide range of applications including medical, military, home, e...

متن کامل

Fault Tolerant Sorting Network

We present a general technique for enhancing the reliability of sorting networks, and other comparator based networks. Our technique converts any network that uses unreliable comparators to a fault tolerant network that produces the correct output with overhelming probability, even if each comparator is faulty with some probability smaller than 1/2, independent of the other comparators. The dep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003